Streaming algorithm

Results: 106



#Item
21 Exercise 1 (A streaming algorithm for counting the number of distinct values). [⋆] We are given a stream of numbers x1 , . . . , xn ∈ [m] and we want to compute the number of distinct values in the stream: F0 (x) =

 Exercise 1 (A streaming algorithm for counting the number of distinct values). [⋆] We are given a stream of numbers x1 , . . . , xn ∈ [m] and we want to compute the number of distinct values in the stream: F0 (x) =

Add to Reading List

Source URL: www.liafa.univ-paris-diderot.fr

Language: English - Date: 2015-01-19 07:51:43
22Microsoft PowerPoint - shortest-path-summary

Microsoft PowerPoint - shortest-path-summary

Add to Reading List

Source URL: www.cse.unr.edu

Language: English - Date: 2012-12-20 19:29:20
23 Exercise 1 (Streaming algorithm for frequent items). We want to design a streaming algorithm that nds all the items in a stream of n items with frequency strictly greater than n/k for some xed k . Consider the followin

 Exercise 1 (Streaming algorithm for frequent items). We want to design a streaming algorithm that nds all the items in a stream of n items with frequency strictly greater than n/k for some xed k . Consider the followin

Add to Reading List

Source URL: www.liafa.univ-paris-diderot.fr

Language: English - Date: 2015-01-22 08:15:45
24 Exercise 1 (A streaming algorithm for the second moment of the frequencies). We are given a stream of numbers x1 , . . . , xn ∈ {0, . . . , m − 1} and we want to compute the sum of the squares of the frequencies of

 Exercise 1 (A streaming algorithm for the second moment of the frequencies). We are given a stream of numbers x1 , . . . , xn ∈ {0, . . . , m − 1} and we want to compute the sum of the squares of the frequencies of

Add to Reading List

Source URL: www.liafa.univ-paris-diderot.fr

Language: English - Date: 2015-01-19 07:51:43
25 Exercise 1 (Streaming algorithm for frequent items). We want to design a streaming algorithm that nds all the items in a stream of n items with frequency strictly greater than n/k for some xed k . Consider the followin

 Exercise 1 (Streaming algorithm for frequent items). We want to design a streaming algorithm that nds all the items in a stream of n items with frequency strictly greater than n/k for some xed k . Consider the followin

Add to Reading List

Source URL: www.liafa.univ-paris-diderot.fr

Language: English - Date: 2015-01-22 08:15:45
26Journal of Machine Learning Research872 Submitted 2/09; Revised 12/09; Published 2/10 A Streaming Parallel Decision Tree Algorithm Yael Ben-Haim

Journal of Machine Learning Research872 Submitted 2/09; Revised 12/09; Published 2/10 A Streaming Parallel Decision Tree Algorithm Yael Ben-Haim

Add to Reading List

Source URL: jmlr.org

Language: English - Date: 2010-02-23 15:21:29
27Network data streaming: a computer scientist’s journey in signal processing Jun (Jim) Xu Networking and Telecommunications Group College of Computing

Network data streaming: a computer scientist’s journey in signal processing Jun (Jim) Xu Networking and Telecommunications Group College of Computing

Add to Reading List

Source URL: www.cc.gatech.edu

Language: English - Date: 2007-07-08 13:36:51
28Stochastic Analysis of A Randomized Detection Algorithm for Pollution Attack in P2P Live Streaming Systems Yongkun Li John C.S. Lui The Chinese University of Hong Kong

Stochastic Analysis of A Randomized Detection Algorithm for Pollution Attack in P2P Live Streaming Systems Yongkun Li John C.S. Lui The Chinese University of Hong Kong

Add to Reading List

Source URL: www.cs.cuhk.hk

Language: English - Date: 2011-07-14 21:00:42
29Nearly Optimal Verifiable Data Streaming Johannes Krupp1 , Dominique Schr¨ oder1 , Mark Simkin1 , Dario Fiore2 , Giuseppe Ateniese3,4 , and Stefan Nuernberger1 1

Nearly Optimal Verifiable Data Streaming Johannes Krupp1 , Dominique Schr¨ oder1 , Mark Simkin1 , Dario Fiore2 , Giuseppe Ateniese3,4 , and Stefan Nuernberger1 1

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2015-04-20 09:30:26
30Efficient Elastic Burst Detection in Data Streams Yunyue Zhu Dennis Shasha Department of Computer Science

Efficient Elastic Burst Detection in Data Streams Yunyue Zhu Dennis Shasha Department of Computer Science

Add to Reading List

Source URL: cs.nyu.edu

Language: English - Date: 2009-04-21 16:01:41